Image Projection Ridge Regression for Subspace Clustering
نویسندگان
چکیده
منابع مشابه
Robust Subspace Clustering via Thresholding Ridge Regression
In this material, we provide the theoretical analyses to show that the trivial coefficients always correspond to the codes over errors. Lemmas 1–3 show that our errors-removing strategy will perform well when the lp-norm is enforced over the representation, where p = {1, 2,∞}. Let x 6= 0 be a data point in the union of subspaces SD that is spanned by D = [Dx D−x], where Dx and D−x consist of th...
متن کاملGuided image filtering using signal subspace projection
There are various image filtering approaches in computer vision and image processing that are effective for some types of noise, but they invariably make certain assumptions about the properties of the signal and/or noise which lack the generality for diverse image noise reduction. This study describes a novel generalised guided image filtering method with the reference image generated by signa...
متن کاملKernel Truncated Regression Representation for Robust Subspace Clustering
Subspace clustering aims to group data points into multiple clusters of which each corresponds to one subspace. Most existing subspace clustering methods assume that the data could be linearly represented with each other in the input space. In practice, however, this assumption is hard to be satisfied. To achieve nonlinear subspace clustering, we propose a novel method which consists of the fol...
متن کاملSubspace-Clustering-Based Multispectral Image Compression
This paper describes a subspace clustering strategy for the spectral compression of multispectral images. Unlike standard PCA, this approach finds clusters in different subspaces of different dimension. Consequently, instead of representing all spectra in a single low-dimensional subspace of a fixed dimension, spectral data are assigned to multiple subspaces having a range of dimensions from on...
متن کاملComparison of Subspace Projection Method with Traditional Clustering Algorithms for Clustering Electricity Consumption Data
There are many studies about using traditional clustering algorithms like K-means, SOM and Two-Step algorithms to cluster electricity consumption data for definition of representative consumption patterns or for further classification and prediction work. However, these approaches are lack of scalability with high dimensions. Nevertheless, they are widely used, because algorithms for clustering...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Letters
سال: 2017
ISSN: 1070-9908,1558-2361
DOI: 10.1109/lsp.2017.2700852